An Online Food Court Ordering System

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Online Food Court Ordering System

Increased demand of restaurant-goers generated the need for much attention for the hospitality industry. Providing much option with ease of ordering and delivering is the need of the hours. Technological interference has become mandatory to improve the quality of the service and business in this industry. Evidences are already existed for partial automation of food ordering process in the count...

متن کامل

Software Development Aspects of a Mobile Food Ordering System

Mobile devices and wireless technologies are making a large impact on our lives. Companies that develop mobile applications are continuously evolving their products, aiming at satisfying the customers’ needs even more comprehensively and at higher levels of quality. The Mobile Food Ordering System (MFOS) proposed in this paper is one of the tools that intends to provide a food ordering applicat...

متن کامل

An O(n2.75) Algorithm for Online Topological Ordering

We present a simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O(n) time, independent of the number of edges m inserted. For dense DAGs, this is an improvement over the previous best result of O(min{m 2 log n,m 3 2 + n log n}) by Katriel and Bodlaender. We also provide an empirical comparison of our algorit...

متن کامل

An Õ(n2.5)-Time Algorithm for Online Topological Ordering

We present an Õ(n)-time algorithm for maintaining the topological order of a directed acyclic graph with n vertices while inserting m edges. This is an improvement over the previous result of O(n) by Ajwani, Friedrich, and Meyer.

متن کامل

An Õ(n)-Time Algorithm for Online Topological Ordering

We present an Õ(n)-time algorithm for maintaining the topological order of a directed acyclic graph with n vertices while inserting m edges. This is an improvement over the previous result of O(n) by Ajwani, Friedrich, and Meyer.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Information Technology & Software Engineering

سال: 2016

ISSN: 2165-7866

DOI: 10.4172/2165-7866.1000183